Optimal parallel algorithms for string matching
نویسندگان
چکیده
منابع مشابه
Parallel String Matching Algorithms
String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.
متن کاملAlternative Algorithms for Bit-Parallel String Matching
We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...
متن کاملParallel String Matching Algorithms based on Dataflow
This paper presents efficient dataflow schemes for parallel string matching. Two subproblems known as the exact matching and the k-mismatches problems are covered. Three parallel algorithms based on multiple input (and output) streams are presented. Time complexities of these parallel algorithms are O((n/d)+α), 0 ≤ α ≤ m, where n and m represent lengths of reference and pattern strings (n >> m)...
متن کاملO(k) Parallel Algorithms for Approximate String Matching Approximate String Matching (proposed Running Head)
Given a text string T of length n, a shorter pattern string A of length m, and an integer k, an simple straightforward O(k) parallel algorithm for nding all occurrences of the pattern string in the text string with at most k di erences (as de ned by edit distance) is presented. The algorithm uses the priority CRCW-PRAM model of computation and (n m+ k + 2) m = O(n m) processors. Over recent dec...
متن کاملOptimal Parallel algorithm for String Matching on Mesh Network Structure
In this paper we consider the problem of string matching algorithm based on a two-dimensional mesh. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using mesh connected network which achieves a constant time for mismatch a text string and we obtained O(¥. -ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1985
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80031-0